Convergence Analysis of Decentralized Slot Synchronization Algorithm for Wireless Ad Hoc Networks

نویسندگان

  • Qi Yang
  • Jianghong Shi
  • Biyu Tang
چکیده

Abstract Slot synchronization is essential to Ad Hoc networks based on Time Division Multiplex Access (TDMA). Since there is no central node in the network, it is necessary to use a decentralized algorithm for synchronizing the local time slot reference. In this paper, the convergence performance of the decentralized slot synchronization algorithm for wireless Ad Hoc networks is analyzed for the first time. By introducing a virtual benchmark, we proved that the algorithm is equivalent to a distributed average problem. A mathematic model of the decentralized slot synchronization algorithm is then established for multi-hop network. Moreover, the convergence of the algorithm is proved in mathematic method and studied via simulation experiment.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Decentralized Slot Synchronization In Highly Dynamic Ad Hoc Networks

Ad hoc networks provide data communication services without being bound to an existing infrastructure. An exciting application of highly dynamic ad hoc networks is the exchange of data between running vehicles. For air-interfaces based on a slotted Time Division Multiple Access (TDMA) scheme, slot synchronization is required among the rapidly moving vehicles. In this paper a scheme for complete...

متن کامل

Evaluation of a BIBD Based Directional MAC Protocol for Wireless Ad Hoc Networks

The use of directional antennas in wireless ad hoc networks can significantly improve global performance due to a high spatial channel reuse. Nevertheless, its introduction poses new location dependent problems related to the MAC protocol. In this paper, the Balanced Incomplete Block Design theory has been exploited to develop a new MAC protocol for wireless ad hoc networks using directional ant...

متن کامل

Broadcast Routing in Wireless Ad-Hoc Networks: A Particle Swarm optimization Approach

While routing in multi-hop packet radio networks (static Ad-hoc wireless networks), it is crucial to minimize power consumption since nodes are powered by batteries of limited capacity and it is expensive to recharge the device. This paper studies the problem of broadcast routing in radio networks. Given a network with an identified source node, any broadcast routing is considered as a directed...

متن کامل

Assessment of DSACC and QPART Algorithms in Ad Hoc Networks

The rapid advancement in wireless over wired has augmented the need for improving theQuality of Service (QoS) over such wireless links. However, the wireless ad hoc networkshave too low bandwidth, and establishing a QoS in these networks is a difficult issue. So,support of quality of service in ad hoc networks is the topical issue among the networkscience researchers. In this research we are go...

متن کامل

A New Hybrid Routing Algorithm based on Genetic Algorithm and Simulated Annealing for Vehicular Ad hoc Networks

In recent years, Vehicular Ad-hoc Networks (VANET) as an emerging technology have tried to reduce road damage and car accidents through intelligent traffic controlling. In these networks, the rapid movement of vehicles, topology dynamics, and the limitations of network resources engender critical challenges in the routing process. Therefore, providing a stable and reliable routing algorithm is ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • JCIT

دوره 5  شماره 

صفحات  -

تاریخ انتشار 2010